A Fibred Tableau Calculus for BDI Logics
نویسندگان
چکیده
In [12,16] we showed how to combine propositional BDI logics using Gabbay’s fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based decision procedure for the combined/fibred logics. To achieve this end we first outline with an example two types of tableau systems, (graph & path), and discuss why both are inadequate in the case of fibring. Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori’s labelled tableau system KEM.
منابع مشابه
On Constructing Fibred Tableaux for BDI Logics
In [11,13] we showed how to combine propositional BDI logics using Gabbay’s fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based decision procedure for the combined/fibred logics. We show how to uniformly construct a tableau calculus for the combined logic using Governatori’s labelled tableau system KEM.
متن کاملA Fibred Tableau Calculus for Modal Logics of Agents
In [15,19] we showed how to combine propositional multimodal logics using Gabbay’s fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (graph & path), with the help of a scenario (The Friend’s Puzzle). Having d...
متن کاملFibred Modal Tableaux (preliminary report)
We describe a general and uniform tableau methodology for multi-modal logics arising from Gabbay’s methodology of fibring and Governatori’s tableau system KEM.
متن کاملOn Fibring Semantics for BDI Logics
This study examines BDI logics in the context of Gabbay’s fibring semantics. We show that dovetailing (a special form of fibring) can be adopted as a semantic methodology to combine BDI logics. We develop a set of interaction axioms that can capture static as well as dynamic aspects of the mental states in BDI systems, using Catach’s incestual schema Ga,b,c,d . Further we exemplify the constrai...
متن کاملA Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular gr...
متن کامل